Mean Payoff Games and Linear Complementarity
نویسنده
چکیده
We suggest new pseudopolynomial and subexponential algorithms for Mean Payoff Games (MPGs). The algorithms are based on representing the MPG decision problem in the forms of non-standard and standard Linear Complementarity Problems (LCPs): find w, z ≥ 0 satisfying w = Mz + q and w · z = 0, (1.1) and monotonic iterative propagation of slack updates.
منابع مشابه
Formulating an n-person noncooperative game as a tensor complementarity problem
In this paper, we consider a class of n-person noncooperative games, where the utility function of every player is given by a homogeneous polynomial defined by the payoff tensor of that player, which is a natural extension of the bimatrix game where the utility function of every player is given by a quadratic form defined by the payoff matrix of that player. We will call such a problem the mult...
متن کاملLinear Programming Polytope and Algorithm for Mean Payoff Games
We investigate LP-polytopes generated by mean payoff games and their properties, including the existence of tight feasible solutions of bounded size. We suggest a new associated algorithm solving a linear program and transforming its solution into a solution of the game.
متن کاملCombinatorial Simplex Algorithms Can Solve Mean Payoff Games
A combinatorial simplex algorithm is an instance of the simplex method in which the pivoting depends on combinatorial data only. We show that any algorithm of this kind admits a tropical analogue which can be used to solve mean payoff games. Moreover, any combinatorial simplex algorithm with a strongly polynomial complexity (the existence of such an algorithm is open) would provide in this way ...
متن کاملThe Tropical Shadow-Vertex Algorithm Solves Mean Payoff Games in Polynomial Time on Average
We introduce an algorithm which solves mean payoff games in polynomial time on average, assuming the distribution of the games satisfies a flip invariance property on the set of actions associated with every state. The algorithm is a tropical analogue of the shadowvertex simplex algorithm, which solves mean payoff games via linear feasibility problems over the tropical semiring (R ∪ {−∞},max,+)...
متن کاملPolicy iteration algorithm for zero-sum multichain stochastic games with mean payoff and perfect information
We consider zero-sum stochastic games with finite state and action spaces, perfect information, mean payoff criteria, without any irreducibility assumption on the Markov chains associated to strategies (multichain games). The value of such a game can be characterized by a system of nonlinear equations, involving the mean payoff vector and an auxiliary vector (relative value or bias). We develop...
متن کامل